Graph labeling and radio channel assignment

1998 ◽  
Vol 29 (4) ◽  
pp. 263-283 ◽  
Author(s):  
J. van den Heuvel ◽  
R. A. Leese ◽  
M. A. Shepherd
Author(s):  
Meera Saraswathi, Et. al.

A graph labeling problem is an assignment of labels to the vertices or edges (or both) of a graph G satisfying some mathematical condition. Radio Mean Labeling, a vertex-labeling of graphs with non-negative integers has a significant application in the study of problems related to radio channel assignment. The maximum label used in a radio mean labeling is called its span, and the lowest possible span of a radio mean labeling is called the radio mean number of a graph. In this paper, we obtain the radio mean number of paths and total graph of paths.


Author(s):  
Felix Juraschek ◽  
Mesut Günes ◽  
Bastian Blywis

DES-Chan is a framework for experimentally driven research on distributed channel assignment algorithms in wireless mesh networks. DES-Chan eases the development process by providing a set of common services required by distributed channel assignment algorithms. A new challenge for channel assignment algorithms are sources of external interferences. With the increasing number of wireless devices in the unlicensed radio spectrum, co-located devices that share the same radio channel may have a severe impact on the network performance. DES-Chan provides a sensing component to detect such external devices and predict their future activity. As a proof of concept, the authors present a reference implementation of a distributed greedy channel assignment algorithm. The authors evaluate its performance in the DES-Testbed, a multi-transceiver wireless mesh network with 128 nodes at the Freie Universität Berlin.


1997 ◽  
Vol 46 (4) ◽  
pp. 957-967 ◽  
Author(s):  
Jae-Soo Kim ◽  
Sahng Ho Park ◽  
P.W. Dowd ◽  
N.M. Nasrabadi

Sign in / Sign up

Export Citation Format

Share Document